Prime decomposition: Understanding uniqueness
نویسندگان
چکیده
منابع مشابه
Effective Prime Uniqueness
Assuming the obvious definitions below, we show that a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to the theorem that there are two atomic decidable models which are not computably isomorphic. We end with a section describing the implications of this result in rev...
متن کاملPrime decomposition in the anti-cyclotomic extension
For an imaginary quadratic number field K and an odd prime number l, the anti-cyclotomic Zl-extension of K is defined. For primes p of K, decomposition laws for p in the anti-cyclotomic extension are given. We show how these laws can be applied to determine if the Hilbert class field (or part of it) of K is Zl-embeddable. For some K and l, we find explicit polynomials whose roots generate the f...
متن کاملA local prime factor decomposition algorithm
This work is concerned with the prime factor decomposition (PFD) of strong product graphs. A new quasi-linear time algorithm for the PFD with respect to the strong product for arbitrary, finite, connected, undirected graphs is derived. Moreover, since most graphs are prime although they can have a product-like structure, also known as approximate graph products, the practical application of the...
متن کاملMaximal Prime Subgraph Decomposition of Bayesian Networks
The authors present a method for decomposition of Bayesian networks into their maximal prime subgraphs. The correctness of the method is proven and results relating the maximal prime subgraph decomposition (MPD) to the maximal complete subgraphs of the moral graph of the original Bayesian network are presented. The maximal prime subgraphs of a Bayesian network can be organized as a tree which c...
متن کاملOn uniqueness of prime bipartite factors of graphs
It has long been known that the class of connected nonbipartite graphs (with loops allowed) obeys unique prime factorization over the direct product of graphs. Moreover, it is known that prime factorization is not necessarily unique in the class of connected bipartite graphs. But any prime factorization of a connected bipartite graph has exactly one bipartite factor. Moreover, empirical evidenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Mathematical Behavior
سال: 1996
ISSN: 0732-3123
DOI: 10.1016/s0732-3123(96)90017-6